#include <bits/stdc++.h>

using namespace std;
using ll = long long;

// 乘法快速幂
ll ksm(ll x, int n, int mod) {
	ll ans = 1;
	while (n > 0) {
		if ((n & 1) == 1) {
			ans = (ans * x) % mod;
		}
		x = (x * x) % mod;
		n >>= 1;
	}
	return ans;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << ksm(10, 5, 1000000007) << endl;
	return 0;
}